Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Library automation --- 025:681.3 --- Bibliotheken 02 --- Bibliotheekautomatisering --- 025:681.3 Bibliotheekautomatisering --- Libraries --- Automation --- Library science --- Software

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*I7 --- 681.3*I7 Text processing (Computing methodologies)--See also {681.3*H4} --- Text processing (Computing methodologies)--See also {681.3*H4} --- Computerized typesetting. --- LaTeX (Computer file). --- Computerized typesetting --- Automated typesetting --- Computer typesetting --- Typesetting --- Word processing --- Computer programs --- Data processing --- LaTeX (Computer file) --- #TELE:SISTA --- 681.3 --- Computerwetenschap --- 004 --- 686.22544 --- Graphics industry --- Graphic signs --- Artificial intelligence. Robotics. Simulation. Graphics --- 681.3* / / / / / / / / / / / / / / / / / / / / / / / / / / / / --- TEX (computerprogramma). --- Tekstverwerking. --- Imprimerie --- Composition automatique --- Mathématiques --- Impression --- Latex (computer program)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

025:681.3 --- 002 --- 025.4.036 --- 631.3.06 --- $?$94/03 --- #A9503A --- 025:681.3 Bibliotheekautomatisering --- Bibliotheekautomatisering --- Library automation --- Microcomputers --- Library applications --- Computer programs

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.

Logic programming --- Programmation logique --- 681.3*F41 --- 681.3*I23 --- Computer programming --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Logic programming. --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- COMPUTER SCIENCE/Artificial Intelligence

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Computer science --- Object-oriented programming (Computer science) --- System analysis --- System design --- 681.3*H1 --- 681.3*D21 --- 681.3*D22 --- Models and principles (Information systems) --- Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- Tools and techniques: decision tables; flow charts; modules and interfaces; programmer workbench; software libraries; structured programming; top-down programming; user interfaces (Software engineering) --- System Analysis --- System Design --- 681.3*D22 Tools and techniques: decision tables; flow charts; modules and interfaces; programmer workbench; software libraries; structured programming; top-down programming; user interfaces (Software engineering) --- 681.3*D21 Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- 681.3*H1 Models and principles (Information systems)